qu an t - ph / 9 60 50 10 v 2 8 J an 1 99 7 Bounds on Information and the Security of Quantum Cryptography
نویسنده
چکیده
Strong attacks against quantum key distribution use quantum memories and quantum gates to attack directly the final key. In this paper we extend a novel security result recently obtained, to demonstrate proofs of security against a wide class of such attacks. To reach this goal we calculate information-dependent reduced density matrices, we study the geometry of quantum mixed state, and we find bounds on the information leaked to an eavesdropper. Our result suggests that quantum cryptography is ultimately secure. Quantum cryptography (e.g. [1, 2]) suggests an information secure key distribution. It is based on the fact that non-orthogonal quantum states cannot be cloned, and any attempt to obtain information regarding these states necessarily disturbs them and induces noise. In principle, the legitimate users of a quantum key distribution scheme, Alice and Bob, should quit the protocol if they notice a noise. However, in real protocols, the channels and devices are not perfect, and some errors are inevitable. As long as the rate of errors is small, these errors must be accepted and corrected by the legitimate users. As a result, the eavesdropper, Eve, can obtain some information on the transmitted data, as long as she induces less errors than allowed (e.g., by eavesdropping on a small portion of the transmitted particles). Furthermore,
منابع مشابه
qu an t - ph / 9 71 10 32 v 2 1 3 M ay 1 99 8 The quantum capacity is properly defined without encodings
We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all sources and and block sizes, but not encodings, to bound the quantum capacity. We perform an explicit calculation of this maximum coherent information for the quantum erasure channel and apply the bou...
متن کاملar X iv : 0 90 3 . 31 18 v 1 [ qu an t - ph ] 1 8 M ar 2 00 9 Generation of a Common Reference String , secure against Quantum Adversaries , and Applications
In this paper, we present the generation of a common reference string “from scratch” via coin-flipping in the presence of a quantum adversary. First, we present how we achieve quantumsecure coin-flipping using Watrous’ quantum rewinding technique [Wat06]. Then, by combining this coin-flipping with any non-interactive zero-knowledge protocol we get an easy transformation from non-interactive zer...
متن کاملar X iv : 0 71 2 . 14 94 v 1 [ qu an t - ph ] 1 0 D ec 2 00 7 Improved one - way rates for BB 84 and 6 - state protocols
We study the advantages to be gained in quantum key distribution (QKD) protocols by combining the techniques of local randomization, or noisy preprocessing, and structured (nonrandom) block codes. Extending the results of [Smith, Renes, and Smolin, quant-ph/0607018] pertaining to BB84, we improve the best-known lower bound on the error rate for the 6-state protocol from 14.11% for local randomi...
متن کاملqu an t - ph / 9 80 60 48 14 J un 1 99 8 Quantum Computation With Linear Optics
We present a constructive method to translate small quantum circuits into their optical analogues, using linear components of present-day quantum optics technology only. These optical circuits perform precisely the computation that the quantum circuits are designed for, and can thus be used to test the performance of quantum algorithms. The method relies on the representation of several quantum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997